Centered Discretization with Application to Graphical Passwords ( full paper ) ∗

نویسندگان

  • Sonia Chiasson
  • Jayakumar Srinivasan
  • Robert Biddle
  • P. C. van Oorschot
چکیده

Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of Birget et al.(2006) allows for false accepts and false rejects because the tolerance region is not guaranteed to be centered on the original click-point, causing usability and security concerns. Using empirical data from a large user study, we show that this is a significant issue in practice. We then introduce Centered Discretization, a simpler discretization method that eliminates false accepts and false rejects. It also allows for smaller tolerance regions without impacting the usability of the system.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centered Discretization with Application to Graphical Passwords

Discretization is used in click-based graphical passwords so that approximately correct entries can be accepted by the system. We show that the existing discretization scheme of Birget et al.(2006) allows for false accepts and false rejects because the tolerance region is not guaranteed to be centered on the original click-point, causing usability and security concerns. Using empirical data fro...

متن کامل

Robust discretization, with an application to graphical passwords

When data or the processing on the data has some uncertainty, discretization of those data can lead to significantly different output. For example, in certain graphical password schemes, a slight uncertainty in the clicking places can produce a different password; another example is digital watermarking, where a slight change in the features can produce a different watermark. We present a discr...

متن کامل

Graphical Dictionaries and the Memorable Space of Graphical Passwords

In commonplace textual password schemes, users choose passwords that are easy to recall. Since memorable passwords typically exhibit patterns, they are exploitable by brute-force password crackers using attack dictionaries. This leads us to ask what classes of graphical passwords users find memorable. We postulate one such class supported by a collection of cognitive studies on visual recall, w...

متن کامل

Security Analysis of Graphical Passwords over the Alphanumeric Passwords

Security in the computer is largely supported by the passwords for authentication process. The most common approach for authentication is alphanumeric passwords and alphanumeric passwords which has significant drawbacks. To overcome these drawbacks graphical passwords have been designed. That aim of generating these passwords to make passwords more memorable and easier for people to use and, th...

متن کامل

A Mechanism for Filtering Distractors for Graphical Passwords

Graphical passwords hold some promise in a world of increasing numbers of passwords, which computer users are straining to remember. However, since these kinds of mechanisms are a fairly new innovation many design and implementation problems exist which could well prevent these mechanisms from realising their full potential. This paper addresses the problem of choosing distractors for graphical...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008